On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

Various classes of infinite-state processes are often specified by rewrite systems. We extend Mayr’s Process Rewrite Systems (PRS) [13] by finite-state unit whose transition function satisfies some restrictions inspired by weak finite automata. We classify these models by their expressiveness and show how the hierarchy of new classes (w.r.t. bisimilarity) is related to both PRS hierarchy of May...

Process Rewrite Systems

Many formal models for in nite-state concurrent systems are equivalent to special classes of rewrite systems. We classify these models by their expressiveness and de ne a hierarchy of classes of rewrite systems. We show that this hierarchy is strict with respect to bisimulation equivalence. The most general and most expressive class of systems in this hierarchy is called Process Rewrite Systems...

Modal Process Rewrite Systems

We consider modal transition systems with infinite state space generated by finite sets of rules. In particular, we extend process rewrite systems to the modal setting and investigate decidability of the modal refinement relation between systems from various subclasses. Since already simulation is undecidable for most of the cases, we focus on the case where either the refined or the refining p...

Rewrite Systems

Extended Process Rewrite Systems: Expressiveness and Reachability

We unify a view on three extensions of Process Rewrite Systems (PRS) and compare their expressive power with that of PRS. We show that the class of Petri nets is less expressive up to bisimulation equivalence than the class of PA processes extended with a finite state control unit. Further we show our main result that the reachability problem for PRS extended with a so called weak finite state ...